The "Hardest" Natural Decidable Theory
نویسنده
چکیده
We prove that any decision procedure for a modest fragment of L. Henkin's theory of pure propositional types 7, 12, 15, 11] requires time exceeding a tower of 2's of height exponential in the length of input. Until now the highest known lower bounds for natural decidable theories were at most linearly high towers of 2's and since mid-seventies it was an open problem whether natural decidable theories requiring more than that exist 12, 2]. We give the aarmative answer. As an application of this today's strongest lower bound we improve known and settle new lower bounds for several problems in the simply typed lambda calculus.
منابع مشابه
Complexity, decidability and completeness
We give resource bounded versions of the Completeness Theorem for propositional and predicate logic. For example, it is well known that every computable consistent propositional theory has a computable complete consistent extension. We show that, when length is measured relative to the binary representation of natural numbers and formulas, every polynomial time decidable propositional theory ha...
متن کاملGodel's Incompleteness Phenomenon - Computationally
We argue that Gödel’s completeness theorem is equivalent to completability of consistent theories, and Gödel’s incompleteness theorem is equivalent to the fact that this completion is not constructive, in the sense that there are some consistent and recursively enumerable theories which cannot be extended to any complete and consistent and recursively enumerable theory. Though any consistent an...
متن کاملDecidable Theories of the Ordering of Natural Numbers with Unary Predicates
Expansions of the natural number ordering by unary predicates are studied, using logics which in expressive power are located between first-order and monadic second-order logic. Building on the modeltheoretic composition method of Shelah, we give two characterizations of the decidable theories of this form, in terms of effectiveness conditions on two types of “homogeneous sets”. We discuss the ...
متن کاملReal Hilbertianity and the Field of Totally Real Numbers
We use moduli spaces for covers of the Riemann sphere to solve regular embedding problems, with prescribed extendability of orderings, over PRC fields. As a corollary we show that the elementary theory of Qtr is decidable. Since the ring of integers of Qtr is undecidable, this gives a natural undecidable ring whose quotient field is decidable.
متن کاملInductive Definitions with Decidable Atomic Formulas
We introduce a type theory for innnitely branching trees, called the theory of free algebras. In this type theory we deene an exten-sional equality based on decidable atomic formulas only. We show, that equality axioms, which add full extensionality to the theory, yield a conservative extension of the (intensional) type theory for formulas having types of level 1. Types like nat ! nat and well-...
متن کامل